Searching with Lies
نویسندگان
چکیده
منابع مشابه
Some Results on Searching with Lies
Two instances of the searching problem, when the answers are unreliable, are approached. If Q is the lower bound for the problem: { when using membership questions we show that (Q + 1) questions are suucient for searching an element in the set f1; : : : ; ng , for any n, when at most 3 errors are allowed. On one side it is the best known result holding for any n, on the other side the used tech...
متن کاملSearching with lies under error cost constraints
The Rényi-Berlekamp-Ulam game is a classical model for the problem of determining the minimum number of queries to find an unknown member in a finite set when up to a finite number of the answers may be erroneous. In the variant considered in this paper, questions with q many possible answers are allowed, further lies are constrained by a bipartite graph with edges weighted by 0, 1, 2, . . . (t...
متن کاملSearching with a Constant Rate of Malicious Lies
The problem of searching in the presence of errors is modeled as a game between a questioner and a responder. The responder chooses an integer x 2 f1; : : : ; ng; and the questioner has to determine x asking comparison queries. The responder may lie at his pleasure, provided that at the end of the game the fraction of lies does not exceed a certain constant r: It is known that the questioner ma...
متن کاملLogic and Algebra in Ulam's Searching Game with Lies
What I tell you three times is true LEWIS CARROLL Introduction In the familiar two-person game "Guess a Number", the first player chooses a number c in a certain set S, and the second player tries to find the secret number, by asking a few questions, to which the first player can only answer yes or no. Here, one might correctly object that since 1 is the only odd number in S that is also smalle...
متن کاملUlam's Searching Game with a Fixed Number of Lies
Spencer, J., Ulam’s searching game with a fixed number of lies, Theoretical Computer Science 95 (1992) 3077321. Paul tries to find an unknown x from 1 to n by asking 4 Yes-No questions. In response Carole may lie up to k times. For k fixed and n, 4 sufficiently large, necessary and sufficient conditions are given for Paul to win.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1996
ISSN: 0097-3165
DOI: 10.1006/jcta.1996.0036